Communication Complexity of One-Shot Remote State Preparation

نویسندگان

  • Shima Bab Hadiashar
  • Ashwin Nayak
  • Renato Renner
چکیده

Quantum teleportation uses prior shared entanglement and classical communication to send an unknown quantum state from one party to another. Remote state preparation (RSP) is a similar distributed task in which the sender knows the entire classical description of the state to be sent. (This may also be viewed as the task of non-oblivious compression of a single sample from an ensemble of quantum states.) We study the communication complexity of approximate remote state preparation, in which the goal is to prepare an approximation of the desired quantum state. Jain [Quant. Inf. & Comp., 2006] showed that the worst-case communication complexity of approximate RSP can be bounded from above in terms of the maximum possible information in an encoding. He also showed that this quantity is a lower bound for communication complexity of (exact) remote state preparation. In this work, we tightly characterize the worst-case and average-case communication complexity of remote state preparation in terms of non-asymptotic information-theoretic quantities. We also show that the average-case communication complexity of RSP can be much smaller than the worst-case one. In the process, we show that n bits cannot be communicated with less than n transmitted bits in LOCC protocols. This strengthens a result due to Nayak and Salzman [J. ACM, 2006] and may be of independent interest.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classical Communication Cost in Distributed Quantum Information Processing—A generalization of Quantum Communication Complexity

We study the amount of classical communication needed for distributed quantum information processing. In particular, we introduce the concept of ”remote preparation” of a quantum state. Given an ensemble of states, Alice’s task is to help Bob in a distant laboratory to prepare a state of her choice. We find several examples of an ensemble with an entropy S where the remote preparation can be do...

متن کامل

Communication complexity of remote state preparation with entanglement

Definition 1 (Remote state preparation) Let Alice, who knows the function E, get an input x ∈ X. Alice and Bob are required to communicate and at the end of the communication Bob should have a quantum state ρx such that F (ρx, E(x)) ≥ 1− ǫ, for some 0 ≤ ǫ < 1. Alice and Bob may start with some prior entanglement between them. In several papers in the remote state preparation problem, Alice inst...

متن کامل

Near optimal bounds on quantum communication complexity of single-shot quantum state redistribution

We show near optimal bounds on the worst case quantum communication of single-shot entanglement-assisted one-way quantum communication protocols for the quantum state redistribution task and for the sub-tasks quantum state splitting and quantum state merging. Our bounds are tighter than previously known best bounds for the latter two sub-tasks. A key technical tool that we use is a convex-split...

متن کامل

Remote state preparation.

Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be transmitted. We show that the asymptotic classical communication cost of RSP is one bit per qubit--half that of teleportation--and even less when transmitting...

متن کامل

Resources required for exact remote state preparation

It has been shown [M.-Y. Ye, Y.-S. Zhang, and G.-C. Guo, Phys. Rev. A. 69, 022310 (2004)] that it is possible to perform exactly faithful remote state preparation using finite classical communication and any entangled state with maximal Schmidt number. Here we give an explicit procedure for performing this remote state preparation. We show that the classical communication required for this sche...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1802.07795  شماره 

صفحات  -

تاریخ انتشار 2018